Degree distributions of growing networks.
نویسندگان
چکیده
The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree). The network is built by (i) creation of new nodes which each immediately attach to a preexisting node, and (ii) creation of new links between preexisting nodes. This process naturally generates correlated in-degree and out-degree distributions. When the node and link creation rates are linear functions of node degree, these distributions exhibit distinct power-law forms. By tuning the parameters in these rates to reasonable values, exponents which agree with those of the web graph are obtained.
منابع مشابه
Markov chain-based numerical method for degree distributions of growing networks.
In this paper, we establish a relation between growing networks and Markov chains, and propose a computational approach for network degree distributions. Using the Barabási-Albert model as an example, we first show that the degree evolution of a node in a growing network follows a nonhomogeneous Markov chain. Exploring the special structure of these Markov chains, we develop an efficient algori...
متن کاملGIS-based analysis of spatial distribution patterns of growing degree-days for agricultural applications in Iran
The geographical distribution of growing degree-days (GDDs) within Iran was studied using GIS-based maps. GDDs were calculated using daily thermal parameters (daily maximum and minimum air temperature). Based on the purpose of the study and climatic conditions of Iran, the average value of 5?C was chosen for GDD calculation. The calculations were carried out using daily weather data of 113 mete...
متن کاملTail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributio...
متن کاملGrowing Hierarchical Scale-Free Networks by Means of Nonhierarchical Processes
We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degreedegree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional ...
متن کاملFiniteness and fluctuations in growing networks
We study the role of finiteness and fluctuations about average quantities for basic structural properties of growing networks. We first determine the exact degree distribution of finite networks by generating function approaches. The resulting distributions exhibit an unusual finite-size scaling behaviour and they are also sensitive to the initial conditions. We argue that fluctuations in the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 86 23 شماره
صفحات -
تاریخ انتشار 2001